Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Throughput Capacity of Selfish Wireless Ad Hoc Networks with General Node Density

In this paper, we study the throughput capacity of wireless networks considering the selfish feature of interaction between nodes. In our proposed network model, each node has a probability of cooperating to relay transmission. According to the extent of selfishness, we, by the application of percolation theory, construct a series of highways crossing the network. The transmission strategy is t...

متن کامل

Throughput Capacity of Wireless Ad Hoc Networks with Multicast Traffic

The focus of this paper is on presenting new results on throughput capacity of wireless ad hoc networks with multicast traffic. In seminal works [1], Gupta and Kumar introduced a new line of research. It is about the asymptotic throughput capacity of dense wireless ad hoc networks as a function of the number of nodes in the network. First, we present results on asymptotic behavior of a random a...

متن کامل

A Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks

Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...

متن کامل

Energy Efficiency of Ad Hoc Wireless Networks with Selfish Users

We deal with energy efficiency and quality of service provisioning in multihop ad hoc wireless networks. We assume that each node generates traffic for some other node in the network and that the available routes between each source-destination pair are known. Each source randomly selects one of the possible routes and asks the intermediate nodes on the route to relay traffic. Since energy is a...

متن کامل

Energy Efficiency of Ad Hoc Wireless Networks with Selfish Users

We deal with energy efficiency and quality of service provisioning in multihop ad hoc wireless networks. We assume that each node generates traffic for some other node in the network and that the available routes between each source-destination pair are known. Each source randomly selects one of the possible routes and asks the intermediate nodes on the route to relay traffic. Since energy is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information

سال: 2016

ISSN: 2078-2489

DOI: 10.3390/info7010016